A Non-monotonic Extension of Universal Moral Grammar Theory Gert-Jan Munneke () Institute for Logic, Language and Computation University of Amsterdam 107 Science Park, Amsterdam, 1090 GE The Netherlands

Source URL: jakubszymanik.com

On the Complexity of Abstract Categorial Grammars In this abstract we investigate the respective complexities of the membership and the universal membership problems for Abstract Categorial Grammars [dG01]. This problem

Source URL: wwwhomes.uni-bielefeld.de

• Logic in computer science
• Theoretical computer science
• Mathematics
• Constructible universe
• Mathematical logic
• CurryHoward correspondence
• Table of stars with Bayer designations
• Generalised Whitehead product

Equideductive Logic and CCCs with Subspaces Paul Taylor Domains Workshop IX U of Sussex, Tuesday, 23 September 2008

Source URL: www.paultaylor.eu

• Mathematical logic
• Model theory
• Structure
• Universal algebra
• Homotopy theory
• Generalised Whitehead product
• Sigma-algebra

Relational program logics in decomposed style Lennart Beringer ∗ Department of Computer Science, Princeton University, 35 Olden Street, Princeton NJ 08540

Source URL: www.cs.princeton.edu

• Model theory
• Formal languages
• Mathematical logic
• Structure
• Universal algebra
• Interpretation
• Relational algebra
• Substitution

RDP 2015, Jun. 30, 2015, WCMCS, Warsaw. From syntax to semantics of Dependent Type Theories - Formalized by Vladimir Voevodsky

Source URL: hott-uf.gforge.inria.fr

• Mathematics
• Academia
• Mathematical logic
• Type theory
• Abstract algebra
• Logic in computer science
• Mathematical structures
• Formal methods
• Intuitionistic type theory
• Expression
• Lambda calculus
• Universal algebra

Automating Leibniz’s Theory of Concepts Automating Leibniz’s Theory of Concepts∗ Jesse Alama Vienna University of Technology

Source URL: mally.stanford.edu

• Logic
• Philosophy
• Mathematics
• Category theory
• Model theory
• Functions and mappings
• Universal property
• Saul Kripke
• First-order logic
• Sheaf
• Function
• Substitution

Resource-Restricted Indifferentiability? Gr´egory Demay, Peter Gaˇzi, Martin Hirt, and Ueli Maurer Department of Computer Science, ETH Zurich, Switzerland {gregory.demay,peter.gazi,hirt,maurer}@inf.ethz.ch Abstract. A

Source URL: pub.ist.ac.at

• Computability theory
• Mathematical logic
• Model theory
• Structure
• Universal algebra
• Reduction
• Symbol
• Sigma-algebra
• Decomposition of spectrum

J. Symbolic Computation, 235–265 The Magma Algebra System I: The User Language† WIEB BOSMA‡, JOHN CANNON§ AND CATHERINE PLAYOUST¶ Computational Algebra Group, School of Mathematics and Statistics, The

Source URL: www.math.ru.nl

• Algebra
• Mathematics
• Abstract algebra
• Universal algebra
• Mathematical structures
• Mathematical logic
• Algebraic structures
• Magma
• Sigma-algebra
• Structure
• F-algebra
• Model theory

Intro First-order theories Higher-order theories

Source URL: www.lama.univ-savoie.fr

• Mathematics
• Logic
• Mathematical structures
• Mathematical logic
• Model theory
• Universal algebra
• Metalogic
• Lawvere theory
• Topology
• William Lawvere
• Structure

A Concise Summary of the Event-B mathematical toolkit 1 Each construct will be given in its presentation form, as displayed in the Rodin toolkit, followed by the ASCII form that is used for input to Rodin.

Source URL: wiki.event-b.org

• Mathematics
• Mathematical logic
• Logic
• Automated theorem proving
• Logic programming
• Set theory
• Mathematical notation
• Set-builder notation
• Substitution
• Universal quantification
• FO
• Associative property